Continuation semantics for the Lambek-Grishin calculus

نویسندگان

  • Raffaella Bernardi
  • Michael Moortgat
چکیده

Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a structured configuration of formulas A1, . . . , An. The absence of structural context in the succedent makes the analysis of a number of phenomena in natural language semantics problematic. A case in point is scope construal: the different possibilities to build an interpretation for sentences containing generalized quantifiers and related expressions. In this paper, we explore a symmetric version of categorial grammar, based on work by Grishin [15]. In addition to the Lambek product, left and right division, we consider a dual family of type-forming operations: coproduct, left and right difference. Communication between the two families is established by means of structurepreserving distributivity principles. We call the resulting system LG. We present a Curry-Howard interpretation for LG(/, \,;, ) derivations, based on Curien and Herbelin’s λμμ̃ calculus [10]. We discuss continuation-passing-style (CPS) translations mapping LG derivations to proofs/terms of Intuitionistic Multiplicative Linear Logic — the categorial system LP which serves as the logic for natural language meaning assembly. We show how LG, thus interpreted, associates sentences with quantifier phrases with the appropriate range of meanings, thus overcoming the expressive limitations of asymmetric categorial grammars in this area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polarized Montagovian Semantics for the Lambek-Grishin Calculus

Grishin ([9]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([14]), who spoke of the Lambek-Grishin calculus (LG). In this paper, we adapt Girard’s polarity-sensitive double negation embedding for classical logic ([7]) to extract a compositional Montagovian semantics from a display calculus fo...

متن کامل

Relational Semantics for the Lambek-Grishin Calculus

We study ternary relational semantics for symmetric versions of the Lambek calculus with interaction principles due to Grishin (1983). We obtain completeness on the basis of a Henkin-style weak filter construction. 1 Background, motivation The categorial calculi proposed by Lambek and their current typelogical extensions respect an “intuitionistic” restriction: in a Gentzen presentation, Lambek...

متن کامل

The Lambek-Grishin Calculus Is NP-Complete

The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.

متن کامل

Tableaux for the Lambek-Grishin calculus

Categorial type logics, pioneered by Lambek ([8]), seek a proof-theoretic understanding of natural language syntax by identifying categories with formulas and derivations with proofs. We typically observe an intuitionistic bias: a structural configuration of hypotheses (a constituent) derives a single conclusion (the category assigned to it). Acting upon suggestions of Grishin ([3]) to dualize ...

متن کامل

Continuation Semantics for Symmetric Categorial Grammar

Categorial grammars in the tradition of Lambek [1,2] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a structured configuration of formulas A1, . . . , An. The absence of structural context in the succedent makes the analysis of a number of phenomena in natural language semantics problematic. A case in point is scope construal:...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 208  شماره 

صفحات  -

تاریخ انتشار 2010